A Unique Space Saving Accelerator Cavity Design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PHOTONIC BAND GAP ACCELERATOR CAVITY DESIGN AT 90 GHz*

In previous work we have proposed utilizing Photonic Band Gap (PBG) structures as a new class of high-energy, high-intensity accelerator cavities. We have completed extensive MAFIA numerical calculations of multicell PBG structures, with each cell consisting of a square array of metal cylinders terminated by conducting sheets and surrounded by microwave absorber on the periphery. We find that o...

متن کامل

A space-saving media table.

A space-saving media table designed to facilitate pouring large quantities of plated media in a small area is described.

متن کامل

A Class Note on Space-Saving Strategies

Straightforward implementation of the dynamic-programming algorithms utilizes quadratic space to produce an optimal global or local alignment. For analysis of long DNA sequences, this space restriction is more crucial than the time constraint. Because of this, different methods have been proposed to reduce the space used for aligning globally or locally two sequences. We first describe a space-...

متن کامل

A Hybrid Design Space Exploration Approach for a Coarse-Grained Reconfigurable Accelerator

Multitude parameters involved in the design process of a reconfigurable accelerator which is exploited in embedded systems brings about a remarkable complexity and large design space. One effective technique is design space exploration which is capable to find a right balance between the different design parameters. Quantitative design approach is an alternative which uses the data collected fr...

متن کامل

Space Saving by Dynamic Algebraization

Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming algorithm based on tree decompositions in polynomial space. We show how to construct a tree decomposition and extend the algebraic techniques of Lokshtanov and Nede...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Nuclear Science

سال: 1981

ISSN: 0018-9499,1558-1578

DOI: 10.1109/tns.1981.4331923